Sub-linear Universal Spatial Gossip Protocols
نویسندگان
چکیده
Gossip protocols are communication protocols in which, periodically, every node of a network exchanges information with some other node chosen according to some (randomized) strategy. These protocols have recently found various types of applications for the management of distributed systems. Spatial gossip protocols are gossip protocols that use the underlying spatial structure of the network, in particular for achieving the ”closest-first” property. This latter property states that the closer a node is to the source of a message the more likely it is to receive this message within a prescribed amount of time. Spatial gossip protocols find many applications, including the propagation of alarms in sensor networks, and the location of resources in P2P networks. We design a sub-linear spatial gossip protocol for arbitrary graphs metric. More specifically, we prove that, for any graph metric with maximum degree ∆, for any source s and any ball centered at s with size b, new information is spread from s to all nodes in the ball within O(( √ b log b log log b+∆) log b) rounds, with high probability. Moreover, when applied to general metrics with uniform density, the same protocol achieves a propagation time of O(log b log log b) rounds.
منابع مشابه
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding algorithms may lead to broadcast storms where the number of collisions is so large that it causes sys...
متن کاملProtocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise underlying distributed gossip is very simple: in each time step, each node in the system selects some other node as a communication partner — generally by a simple randomized rule — and exchanges information with ; ove...
متن کاملClique Gossiping
This paper proposes and investigates a framework for clique gossip protocols. As complete subnetworks, the existence of cliques is ubiquitous in various social, computer, and engineering networks. By clique gossiping, nodes interact with each other along a sequence of cliques. Clique-gossip protocols are defined as arbitrary linear node interactions where node states are vectors evolving as lin...
متن کاملGossip and Random Walk Techniques for Network Coding
Ad hoc and sensor networks usually do not have a central entity for managing information spreading. Moreover, such wireless stations have limited energy and computational power. All this leads to a need for distributed and efficient algorithms for disseminating information across the network. Network coding in conjunction with random walks and gossip techniques proposes a local and distributed ...
متن کاملOn Gossip and Populations
Gossip protocols are simple, robust and scalable and have been consistently applied to many (mostly wired) distributed systems. Nevertheless, most validation in this area has been empirical so far and there is a lack of a theoretical counterpart to characterize what can and cannot be computed with gossip protocols. Population protocols, on the other hand, benefit from a sound theoretical framew...
متن کامل